Judging a commit by its cover; or can a commit message predict build failure?
نویسندگان
چکیده
Developers summarize their changes to code in commit messages. When a message seems “unusual”, however, this puts doubt into the quality of the code contained in the commit. We trained n-gram language models and used cross-entropy as an indicator of commit message “unusualness” of over 120 000 commits from open source projects. Build statuses collected from Travis-CI were used as a proxy for code quality. We then compared the distributions of failed and successful commits with regards to the “unusualness” of their commit message. Our analysis yielded significant results when correlating cross-entropy with build status.
منابع مشابه
Exploitation of Unlawful Crime (Note 122 of the Islamic Penal Code, adopted in 1392) from the point of view of the Shi'a religious principles
Sometimes he commit all crimes, but he does not achieve the result again. If this failure to fail to achieve the result is due to a lack of subject matter or a failure to act as a means of committing a crime, it would be impossible to commit a crime. Regarding the method of this research, which is fundamental (descriptive-analytic), by referring to the principled books, we find that the Shichr(...
متن کامل2-phase Commit Protocol
DEFINITION The 2-phase commit (2PC) protocol is a distributed algorithm to ensure the consistent termination of a transaction in a distributed environment. Thus, via 2PC an unanimous decision is reached and enforced among multiple participating servers whether to commit or abort a given transaction, thereby guaranteeing atomicity. The protocol proceeds in two phases, namely the prepare (or voti...
متن کاملFinally the Weakest Failure Detector for Non-Blocking Atomic Commit
Recent papers [7, 9] define the weakest failure detector for solving the Non-Blocking Atomic Commit problem (NBAC) in a message passing system where processes can fail by crashing and a majority of processes never crash. In this paper, we generalize the result by presenting the weakest failure detector to solve NBAC in any environment, i.e., without any assumption on the number of processes tha...
متن کاملAutomatic Classification of Large Changes into Maintenance Categories
Large software systems undergo significant evolution during their lifespan, yet often individual changes are not well documented. In this work, we seek to automatically classify large changes into various categories of maintenance tasks — corrective, adaptive, perfective, feature addition, and non-functional improvement — using machine learning techniques. In a previous paper, we found that man...
متن کاملByzantine Generals and Transaction Commit Protocols
The transaction commit problem in a distributed database system is an instance of the Weak Byzantine Generals problem. It is shown that even under the assumption that a process can fail only by “crashing”—failing to send any more messages—a solution to this problem that can tolerate k failures must, in the worst case, require at least k + 1 message-passing delays. Under this same assumption, a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- PeerJ PrePrints
دوره 4 شماره
صفحات -
تاریخ انتشار 2016